Routing Algorithms for IBM SP1
نویسندگان
چکیده
Scalable multicomputers are based upon interconnection net works that typically provide multiple communication routes between any given pair of processor nodes Routes must be selected for communica tion so that the load is distributed evenly among the links and switches to prevent congestion in the network We describe the route selection algorithm used in the IBM SP multicomputer We then describe a new algorithm for reducing network congestion and compare the two algorithms
منابع مشابه
Routing Improvement for Vehicular Ad Hoc Networks (VANETs) Using Nature Inspired Algorithms
are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملAdaptive Routing on the New Switch Chip for IBM SP Systems
The IBM RS 6000 SP is one of the most successful commercially available multicomputers. SP owes its success partially to the scalable, high bandwidth, low latency network. This paper describes the architecture of Switch2 switch chip, the recently developed third generation switching element which future IBM RS 6000 SP systems may be based on. Switch2 offers significant enhancements over the exi...
متن کاملA Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کامل